Symmetry in Matrix Models

نویسندگان

  • Pierre Flener
  • Brahim Hnich
  • Toby Walsh
چکیده

Many constraint satisfaction problems (such as scheduling, assignment, and configuration) can be modelled as constraint programs based on matrices of decision variables. In such matrix models, symmetry is an important feature. We study and generalise symmetry-breaking techniques, such as lexicographic ordering, and propose a labelling technique achieving the same effect.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Calculation of Buckling Load and Eigen Frequencies for Planar Truss Structures with Multi-Symmetry

In this paper, the region in which the structural system is situated is divided into four subregions, namely upper, lower, left and right subregions. The stiffness matrix of the entire system is then formed and using the existing direct symmetry and reverse symmetry, the relationships between the entries of the matrix are established. Examples are included to illustrate the steps of the method.

متن کامل

Noether Symmetry in f(T) Theory at the anisotropic universe

As it is well known, symmetry plays a crucial role in the theoretical physics. On other hand, the Noether symmetry is a useful procedure to select models motivated at a fundamental level, and to discover the exact solution to the given lagrangian. In this work, Noether symmetry in f(T) theory on a spatially homogeneous and anisotropic Bianchi type I universe is considered. We discuss the Lagran...

متن کامل

On Symmetry of Some Nano Structures

It is necessary to generate the automorphism group of a chemical graph in computer-aided structure elucidation. An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for i≠j, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce...

متن کامل

Symmetry-Breaking Constraints for Matrix Models

Many CSPs can be effectively represented and efficiently solved using matrix models, in which the matrices may have symmetry between their rows and/or columns. Eliminating all such symmetry can be very costly as there are in general exponentially many symmetries. Cost-effective methods have been proposed to break much of the symmetry, if not all. In this paper, we continue with this line of res...

متن کامل

Reducing Symmetry in Matrix Models: SBDS v. Constraints

We discuss diierent methods of reducing symmetry in CSPs where the variables correspond to the cells of a matrix, and both the rows and the columns of the matrix are interchangeable. Two basic approaches are considered: adding symmetry-breaking constraints to the model, and breaking symmetry during search. We also show how the two approaches can be combined in this case. We empirically compare ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001